- desargues' graph
- граф дезарга
English-Russian dictionary of electronics. 2015.
desargues' graph
Смотреть что такое "desargues' graph" в других словарях:
Desargues graph — Named after Gérard Desargues Vertices 20 Edges 30 … Wikipedia
Desargues' theorem — Perspective triangles. Corresponding sides of the triangles, when extended, meet at points on a line called the axis of perspectivity. The lines which run through corresponding vertices on the triangles meet at a point called the center of… … Wikipedia
Graph factorization — Not to be confused with Factor graph. 1 factorization of Desargues graph: each color class is a 1 factor … Wikipedia
Graphe de Desargues — Le graphe de Desargues Nombre de sommets 20 Nombre d arêtes 30 Distribution des degrés 3 régulier Rayon 5 … Wikipédia en Français
Levi graph — infobox graph name = Levi graph image caption = The Pappus graph, a Levi graph with 18 vertices formed from the Pappus configuration. Vertices labeled with single letters correspond to points in the configuration; vertices labeled with three… … Wikipedia
Möbius–Kantor graph — Named after August Ferdinand Möbius and S. Kantor Vertices 16 … Wikipedia
Gérard Desargues — Girard Desargues Girard Desargues (February 21 1591–October 1661) was a French mathematician and engineer, who is considered one of the founders of projective geometry. Desargues theorem, the Desargues graph, and the crater Desargues on the Moon… … Wikipedia
Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic … Wikipedia
Cubic graph — Not to be confused with graphs of cubic functions. The Petersen graph is a Cubic graph … Wikipedia
Crossing number (graph theory) — A drawing of the Heawood graph with three crossings. This is the minimum number of crossings among all drawings of this graph, so the graph has crossing number cr(G) = 3. In graph theory, the crossing number cr(G) of a graph G is the… … Wikipedia
Nauru graph — The Nauru graph is Hamiltonian. Vertices 24 Edges 36 Radius 4 … Wikipedia
